Inner For-Loop for Speeding Up Blockchain Mining
نویسندگان
چکیده
منابع مشابه
On Speeding up Frequent Approximate Subgraph Mining
Frequent approximate subgraph (FAS) mining has become an interesting task with wide applications in several domains of science. Most of the previous studies have been focused on reducing the search space or the number of canonical form (CF) tests. CF-tests are commonly used for duplicate detection; however, these tests affect the efficiency of mining process because they have high computational...
متن کاملWireless Networks In-the-Loop: Speeding up GNU Radio development
Wireless Networks In-the-Loop can significantly cut the time needed to develop a fully functional wireless communication system. By introducing a virtual RF front-end and a virtual radio channel, which integrate seamlessly with already existing software radio projects, simulations can be run in lieu or in conjunction with real-world tests. The following pages describe a solution and implementat...
متن کاملSpeeding-up structured probabilistic inference using pattern mining
In many domains where experts are the main source of knowledge, e.g., in reliability and risk management, a framework well suited for modeling, maintenance and exploitation of complex probabilistic systems is essential. In these domains, models usually define closed-world systems and result from the aggregation of multiple patterns repeated many times. Object Oriented-based Frameworks such as P...
متن کاملSpeeding Up q-Gram Mining on Grammar-Based Compressed Texts
We present an efficient algorithm for calculating q-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP T of size n that represents string T , the algorithm computes the occurrence frequencies of all q-grams in T , by reducing the problem to the weighted q-gram frequencies problem on a trie-like structure of size m = |T | − dup(q, T...
متن کاملSpeeding Up Relational Data Mining by Learning to
he motivation behind multi-relational data mining is wledge discovery in relational databases containing tiple related tables. One difficulty relational data ing faces is managing intractably large hypothesis ces. We attempt to overcome this difficulty by first pling the hypothesis space. We generate a small set of otheses, uniformly sampled from the space of didate hypotheses, and evaluate thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Computer Science
سال: 2020
ISSN: 2299-1093
DOI: 10.1515/comp-2020-0004